package leetcode;
//新工科OJ星球大战5011
public class Star_Wars {
    public static void main(String[] args) {
        int []a=new int[]{389,207,155,300,299,170,158,301};
        int i,c=1,b=0,x,j;
        for(i=0;i<7;i++){
            if(a[i]>=a[i+1]){
                i=i+1;
            }
            else {
                c++;
                if(c==2){
                    x=a[i+1];
                    for(j=0;j<7;j++){
                        if(x>=a[j])
                            b++;
                    }
                }
            }

        }
        System.out.println(b);
        System.out.println(c);



    }
}
